Vertex partitions of metric spaces with finite distance sets
نویسندگان
چکیده
منابع مشابه
Finite Metric Spaces and Partitions
For example, IR with the regular Euclidean distance is a metric space. It is usually of interest to consider the finite case, where X is an n-point set. Then, the function d can be specified by ( n 2 ) real numbers. Alternatively, one can think about (X,d) is a weighted complete graph, where we specify positive weights on the edges, and the resulting weights on the edges comply with the triangl...
متن کاملChapter 25 Finite Metric Spaces and Partitions
x The problem received the title of 'Buridan's sheep.' The biological code was taken from a young merino sheep, by the Casparo-Karpov method, at a moment when the sheep was between two feeding troughs full of mixed fodder. This code, along with additional data about sheep in general, was fed into CODD. The machine was required: a) to predict which trough the merino would choose, and b) to give ...
متن کاملChapter 26 Finite Metric Spaces and Partitions
For example, IR 2 with the regular Euclidean distance is a metric space. It is usually of interest to consider the finite case, where X is an a set of n points. Then, the function d can be specified by n 2 real numbers; that is, the distance between every pair of points of X. Alternatively, one can think about (X, d) is a weighted complete graph, where we specify positive weights on the edges, ...
متن کاملDistance Graphs of Metric Spaces with Rosenbloom - Tsfasman metric
Rosenbloom and Tsfasman introduced a new metric (RT metric) which is a generalization of the Hamming metric. In this paper we study the distance graphs of spaces Zn q and Sn with Rosenbloom -Tsfasman metric. We also describe the degrees of vertices, components and the chromatic number of these graphs. Distance graphs of general direct product spaces also described.
متن کاملOn Dimension Partitions in Discrete Metric Spaces
Let (W,d) be a metric space and S = {s1 . . . sk} an ordered list of subsets of W . The distance between p ∈ W and si ∈ S is d(p, si) = min{ d(p, q) : q ∈ si }. S is a resolving set forW if d(x, si) = d(y, si) for all si implies x = y. A metric basis is a resolving set of minimal cardinality, named the metric dimension of (W,d). The metric dimension has been extensively studied in the literatur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.002